- branching logic
- условная логика, логика условного перехода (определяющая выбор пути на вероятностном сетевом графике)
English-Russian project management dictionary. 2013.
branching logic
Смотреть что такое "branching logic" в других словарях:
Branching quantifier — In logic a branching quantifier is a partial ordering :langle Qx 1dots Qx n angle of quantifiers for Q∈{∀,∃}. In classical logic, quantifier prefixes are linearly ordered such that the value of a variable x bound by a quantifier Q depends on the… … Wikipedia
Temporal logic — In logic, the term temporal logic is used to describe any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time. It is sometimes also used to refer to tense logic, a particular modal logic… … Wikipedia
Dependence logic — is a logical formalism, created by Jouko Väänänen[1], which adds dependence atoms to the language of first order logic. A dependence atom is an expression of the form , where are terms, and corresponds to the statement that the value of is… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Computation tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… … Wikipedia
Second-order logic — In logic and mathematics second order logic is an extension of first order logic, which itself is an extension of propositional logic.[1] Second order logic is in turn extended by higher order logic and type theory. First order logic uses only… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
Independence-friendly logic — (IF logic), proposed by Jaakko Hintikka and Gabriel Sandu, aims at being a more natural and intuitive alternative to classical first order logic (FOL). IF logic is characterized by branching quantifiers. It is more expressive than FOL because it… … Wikipedia
Computational tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… … Wikipedia
Programmable logic array — A programmable logic array (PLA) is a programmable device used to implement combinational logic circuits. The PLA has a set of programmable AND gate planes, which link to a set of programmable OR gate planes, which can then be conditionally… … Wikipedia
computation tree logic — noun A particular modal logic of branching time with operators next , globally , finally or eventually , until , and weak until . Syn: computational tree logic, CTL … Wiktionary
